Spanning tree

Results: 445



#Item
51The Gamera framework for building custom recognition systems Michael Droettboom Karl MacMillan Ichiro Fujinaga Digital Knowledge Center, Sheridan Libraries The Johns Hopkins University

The Gamera framework for building custom recognition systems Michael Droettboom Karl MacMillan Ichiro Fujinaga Digital Knowledge Center, Sheridan Libraries The Johns Hopkins University

Add to Reading List

Source URL: ldp.library.jhu.edu

Language: English - Date: 2007-03-13 23:53:56
52Exercise 2: Flirting with Synchrony and Asynchrony Task 1: Growing Balls Denote by B(v, r) the ball of radius r around v, i.e., B(v, r) = {u ∈ V : dist(u, v) ≤ r}. Consider the following partitioning algorithm. Algor

Exercise 2: Flirting with Synchrony and Asynchrony Task 1: Growing Balls Denote by B(v, r) the ball of radius r around v, i.e., B(v, r) = {u ∈ V : dist(u, v) ≤ r}. Consider the following partitioning algorithm. Algor

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2014-10-28 15:42:59
53Graph-Based Dependency Parsing  Sandra K¨ubler, Markus Dickinson Based on slides from Ryan McDonald and Joakim Nivre

Graph-Based Dependency Parsing Sandra K¨ubler, Markus Dickinson Based on slides from Ryan McDonald and Joakim Nivre

Add to Reading List

Source URL: cl.indiana.edu

Language: English - Date: 2016-04-22 09:39:52
54CPSC 455b  Written Homework Assignment # 1 Due in class Feb. 12, 2002 These exercises are drawn from the following papers (all obtainable from http://pantheon.yale.edu/~sz38/) and from the related lectures and

CPSC 455b Written Homework Assignment # 1 Due in class Feb. 12, 2002 These exercises are drawn from the following papers (all obtainable from http://pantheon.yale.edu/~sz38/) and from the related lectures and

Add to Reading List

Source URL: zoo.cs.yale.edu

Language: English - Date: 2011-08-29 17:33:56
55IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 61, NO. 12, JUNE 15, Efficient Methods to Compute Optimal Tree Approximations of Directed Information Graphs

IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 61, NO. 12, JUNE 15, Efficient Methods to Compute Optimal Tree Approximations of Directed Information Graphs

Add to Reading List

Source URL: coleman.ucsd.edu

Language: English
56imperial_college_mike_steel.pptx

imperial_college_mike_steel.pptx

Add to Reading List

Source URL: www.mathtreesworkshop.org.uk

Language: English - Date: 2015-10-28 10:32:47
57CS261: A Second Course in Algorithms Lecture #15: Introduction to Approximation Algorithms∗ Tim Roughgarden† February 23, 2016

CS261: A Second Course in Algorithms Lecture #15: Introduction to Approximation Algorithms∗ Tim Roughgarden† February 23, 2016

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-02-28 14:26:27
58Finding Graph Topologies for Feasible Multirobot Motion Planning Pushkar Kolhe Henrik I. Christensen  Abstract— In this paper we present a design methodology

Finding Graph Topologies for Feasible Multirobot Motion Planning Pushkar Kolhe Henrik I. Christensen Abstract— In this paper we present a design methodology

Add to Reading List

Source URL: www.researchgate.net

Language: English
59CS264: Beyond Worst-Case Analysis Lecture #7: Perturbation Stability and Single-Link++∗ Tim Roughgarden† October 13,

CS264: Beyond Worst-Case Analysis Lecture #7: Perturbation Stability and Single-Link++∗ Tim Roughgarden† October 13,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-11-05 02:46:42
60Provenance Segmentation Rui Abreu Dave Archer  Erin Chapman

Provenance Segmentation Rui Abreu Dave Archer Erin Chapman

Add to Reading List

Source URL: www.usenix.org

Language: English